The Growth Range Equivalence Problem for D0L Systems is Decidable

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable

It is decidable for deterministic MSO definable graph-to-string or graphto-tree transducers whether they are equivalent on a context-free set of graphs. It is well known that the equivalence problem for nondeterministic (one-way) finite state transducers is undecidable, even when they cannot read or write the empty string [Gri68]. In contrast, equivalence is decidable for deterministic finite s...

Exploring the inference problem for D0L-Systems

Behavioural Equivalence for Infinite Systems - Partially Decidable!

For finite-state systems non-interleaving equivalences are computation-ally at least as hard as interleaving equivalences. In this paper we showthat when moving to infinite-state systems, this situation may changedramatically.We compare standard language equivalence for process description lan-guages with two generalizations based on traditional approaches captur-ing...

On polynomial growth functions of D0L-systems

The aim of this paper is to prove that every polynomial function that maps the natural integers to the positive integers is the growth function of some D0L-system.